Symmetric recurrence relations and binomial transforms
نویسندگان
چکیده
منابع مشابه
Linear Recurrence Relations for Binomial Coefficients modulo a Prime
We investigate when the sequence of binomial coefficients ( k i ) modulo a prime p, for a fixed positive integer k, satisfies a linear recurrence relation of (positive) degree h in the finite range 0 ≤ i ≤ k. In particular, we prove that this cannot occur if 2h ≤ k < p − h. This hypothesis can be weakened to 2h ≤ k < p if we assume, in addition, that the characteristic polynomial of the relatio...
متن کاملRecurrence Relations between Symmetric Polynomials of n-th Order
The method of symmetric polynomials (MSP) was developed for computation analytical functions of matrices, in particular, integer powers of matrix. MSP does not require for its realization finding eigenvalues of the matrix. A new type of recurrence relations for symmetric polynomials of order n is found. Algorithm for the numerical calculation of high powers of the matrix is proposed.This comput...
متن کاملUsing Recurrence Relations to Count Certain Elements in Symmetric Groups
Let Sn denote the symmetric group of degree n. If 6 ⊆ Sn , then let OMq(6), ODq(6), Œq(6) denote the number of elements in 6 having order: a multiple of q , dividing q, and equal to q , respectively. Similarly, let CMq(6), CDq(6), CEq(6) denote the number of elements in 6 having a cycle (in its disjoint cycle decomposition) of length: a multiple of q , dividing q, and equal to q , respectively....
متن کاملMellin Transforms and Asymptotics The Mergesort Recurrence
Mellin transforms and Dirichlet series are useful in quantifying periodicity phe nomena present in recursive divide and conquer algorithms This note illustrates the tech niques by providing a precise analysis of the standard top down recursive mergesort algo rithm in the average case as well as in the worst and best cases It also derives the variance and shows that the cost of mergesort has a G...
متن کاملMultiple Binomial Transforms and Families of Integer Sequences
Based on the multiple binomial transforms introduced in this paper, the n-fold generating and generated sequences of a given integer sequence can be defined and a family of this integer sequence can be constructed. The family sets form a partition of the set of integer sequences. Special attention is paid to the recurrent integer sequences, which are produced by some linear and homogeneous recu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2013
ISSN: 0022-314X
DOI: 10.1016/j.jnt.2013.03.003